A Markovian concurrency measure

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Markovian Concurrency Measure

The aim of this work is to define a useful concurrency measure, easy to implement and whose computation complexity allows the study of real examples. We extend the measure introduced in [BT87] to a probabilistic one, by means of a natural translation of the synchronized automata of Arnold-Nivat's model to Markov chains: the computation of the measure uses the concept of average time before abso...

متن کامل

A Markovian Concurrency Measure1

The notion of concurrency plays a central role in parallel processing, and has been studied rather extensively over the last decade mostly from algebraic and/or semantic point of view. This explains why the published literature on concurrency measures is scanty. J. Françon [10] has shown how to count explicitely the number of correct (i.e. without deadlock) behaviours of parallel systems under ...

متن کامل

A Simple Run-time Concurrency Measure

A “concurrency measure” provides an objective means of comparing the level of parallelism achievable by a distributed computation. To date such measures have only been applicable after a computation has successfully terminated. This paper develops a notion of “observed concurrency” that can be continuously evaluated as a computation proceeds. It is suitable for nested parallelism and evaluation...

متن کامل

Auditory distortion measure for speech coder evaluation - Hidden Markovian approach

This article introduces a methodology for quantifying the distortion introduced by a low or medium bit-rate speech coder. Since the perceptual acuity of a human being determines the precision with which speech data must be processed, the speech signal is transformed onto a perceptual-domain (PD). This is done using Lyon's cochlear (auditory) model whose output provides the probability-of-firing...

متن کامل

Performability Measure for Acyclic Markovian Models Hédi Nabli

Degradable performance of fault-tolerant computer systems has given rise to considerable interest in mathematical models for combined evaluation of performance and reliability. Most of these models are based upon Markov processes. Several methods have been proposed for the computation of the probability distribution of performability upon an interval of time 0; t]. In this paper, two closed for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Theoretical Informatics and Applications

سال: 1996

ISSN: 0988-3754,1290-385X

DOI: 10.1051/ita/1996300402951